منابع مشابه
2-Median Problems in Tree Networks
Facility Location Problems have a great significance for allocating resources efficiently in a network. The interaction mainly involves a price which depends on the distances between the objects and the order of significance of the objects(clients). The applications of such problems are immense in many application areas such as medical and transportation. In this project, we consider the p-medi...
متن کاملMultifacility ordered median problems on networks: A further analysis
In this paper, we address the ordered p-median problem, which includes as special cases most of the classical multifacility location problems discussed in the literature. Finite dominating sets (FDS) are known for particular instances of this problem: p-median, p-center, and p-centdian. We find an FDS for the ordered p-median problem. This set allows us to gain a better insight into the general...
متن کاملThe p-median and p-center Problems on Bipartite Graphs
Let $G$ be a bipartite graph. In this paper we consider the two kind of location problems namely $p$-center and $p$-median problems on bipartite graphs. The $p$-center and $p$-median problems asks to find a subset of vertices of cardinality $p$, so that respectively the maximum and sum of the distances from this set to all other vertices in $G$ is minimized. For each case we present some proper...
متن کاملQuadratic Ordered Median Location Problems
The criteria used in location analysis have to be chosen according to the character of the facility. The single facility location models addressed in this paper accommodate simultaneous multiple criteria in a continuous space in the framework of ordered median problems, which generate and unify many standard location problems. We demonstrate that tools of computational geometry such as Voronoi ...
متن کاملLocating median cycles in networks
In the median cycle problem the aim is to determine a simple cycle through a subset of vertices of a graph involving two types of costs: a routing cost associated with the cycle itself, and the cost of assigning vertices not on the cycle to visited vertices. The objective is to minimize the routing cost, subject to an upper bound on the total assignment cost. This problem arises in the location...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SSRN Electronic Journal
سال: 2009
ISSN: 1556-5068
DOI: 10.2139/ssrn.1428362